Stack distance density and page fault probability in virtual memory systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Neural Based Approach and Probability Density Approximation for Fault Detection and Isolation in Nonlinear Systems

A locally recurrent neural network based fault detection and isolation approach is presented. A model of the system under test is created by means of a dynamic neural network. The fault detection is performed on the basis of the statistical analysis of the residual provided by the estimated density shaping of residuals in the case of nominal value of all the parameters, made of a simply neural ...

متن کامل

Stack Compaction for Memory constrained Systems

Embedded systems are under heavy memory constrains. In order to lower the memory footprint of programs, we propose to compact the stack by overlaying variables. Variables that don’t interfere with each other are potential candidates for an overlaying. Our heuristics consist of two parts. The first heuristic chooses a next variable for allocation, the second heuristic then chooses an actual memo...

متن کامل

Page Replacement for Write References in NAND Flash Based Virtual Memory Systems

Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the ...

متن کامل

Shared Page Table : Sharing of Virtual Memory Resources ∗

Traditionally, UNIX has been weak in data sharing. By data sharing, we mean that multiple cooperative processes concurrently access and update the same set of data. As the degree of sharing (the number of cooperative processes) increases, the existing UNIX virtual memory systems run into page table thrashing, which causes a major performance bottleneck. Once page table thrashing occurs, UNIX pe...

متن کامل

Delphi: Predition-based Page Prefetching to Improve the Performance of Shared Virtual Memory Systems

Software distributed shared memory (SDSM) systems traditionally exhibit poor performance on applications with significant fine-grain or false sharing. Techniques such as relaxedconsistency models and multiple -writers protocols improve the performance of SDSM systems significantly, but their performance still lags that of hardware shared memory implementations. This paper describes Delphi, a sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1976

ISSN: 0898-1221

DOI: 10.1016/0898-1221(76)90004-3